Bipartite graphs

Results: 105



#Item
71Treewidth and graph minors Lectures 9 and 10, December 29, 2011, January 5, 2012 We shall touch upon the theory of Graph Minors by Robertson and Seymour. This theory gives a very general condition under which a graph pro

Treewidth and graph minors Lectures 9 and 10, December 29, 2011, January 5, 2012 We shall touch upon the theory of Graph Minors by Robertson and Seymour. This theory gives a very general condition under which a graph pro

Add to Reading List

Source URL: www.wisdom.weizmann.ac.il

Language: English - Date: 2012-01-05 11:55:55
72Bipartite graphs of approximate rank 1. W. T. Gowers §1. Introduction. Quasirandomness is a central concept in graph theory, and has played an important part in arithmetic combinatorics as well. Roughly speaking, a noti

Bipartite graphs of approximate rank 1. W. T. Gowers §1. Introduction. Quasirandomness is a central concept in graph theory, and has played an important part in arithmetic combinatorics as well. Roughly speaking, a noti

Add to Reading List

Source URL: www.dpmms.cam.ac.uk

Language: English - Date: 2007-05-19 10:57:27
73OddBall: Spotting Anomalies in Weighted Graphs Leman Akoglu Mary McGlohon  Christos Faloutsos

OddBall: Spotting Anomalies in Weighted Graphs Leman Akoglu Mary McGlohon Christos Faloutsos

Add to Reading List

Source URL: www.cs.cmu.edu

Language: English - Date: 2010-02-28 14:32:30
74Approximately Counting Perfect Matchings in General Graphs Martin F¨ urer ∗ Shiva Prasad Kasiviswanathan Computer Science and Engineering Pennsylvania State University University Park, PA 16802. {furer, kasivisw}@cse.

Approximately Counting Perfect Matchings in General Graphs Martin F¨ urer ∗ Shiva Prasad Kasiviswanathan Computer Science and Engineering Pennsylvania State University University Park, PA 16802. {furer, kasivisw}@cse.

Add to Reading List

Source URL: www.siam.org

Language: English - Date: 2005-07-06 08:19:14
75Non-Stretchable Pseudo-Visibility Graphs  Ileana Streinu Dept. of Computer Science, Smith College, Northampton, MA 01063, USA.

Non-Stretchable Pseudo-Visibility Graphs Ileana Streinu Dept. of Computer Science, Smith College, Northampton, MA 01063, USA.

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2003-06-20 15:59:40
76First Section  Flavors of Rigidity Flavor IV - Reconstructing Discrete Networks University of Pittsburgh

First Section Flavors of Rigidity Flavor IV - Reconstructing Discrete Networks University of Pittsburgh

Add to Reading List

Source URL: www.math.cornell.edu

Language: English - Date: 2015-01-22 09:08:15
77Piecewise-linear distance-dependent random graph models

Piecewise-linear distance-dependent random graph models

Add to Reading List

Source URL: www.mssanz.org.au

Language: English - Date: 2013-01-15 22:33:07
78Better bounds for matchings in the streaming model Michael Kapralov∗ July 26, 2012 Abstract In this paper we present improved bounds for approximating maximum matchings in bipartite graphs in

Better bounds for matchings in the streaming model Michael Kapralov∗ July 26, 2012 Abstract In this paper we present improved bounds for approximating maximum matchings in bipartite graphs in

Add to Reading List

Source URL: people.csail.mit.edu

Language: English - Date: 2014-12-09 10:13:50
79ARC MINIMIZATION IN FINITE STATE DECODING GRAPHS WITH CROSS-WORD ACOUSTIC CONTEXT G. Zweig, G. Saon F. Yvon

ARC MINIMIZATION IN FINITE STATE DECODING GRAPHS WITH CROSS-WORD ACOUSTIC CONTEXT G. Zweig, G. Saon F. Yvon

Add to Reading List

Source URL: research.microsoft.com

Language: English - Date: 2002-08-23 18:15:24
80Perfect Matchings in O(n log n) Time in Regular Bipartite Graphs Ashish Goel∗ Michael Kapralov†  Sanjeev Khanna‡

Perfect Matchings in O(n log n) Time in Regular Bipartite Graphs Ashish Goel∗ Michael Kapralov† Sanjeev Khanna‡

Add to Reading List

Source URL: people.csail.mit.edu

Language: English - Date: 2014-12-09 10:13:49